Fast coding of low-entropy sources

نویسندگان

  • Boris Ryabko
  • Marina P. Sharova
چکیده

The problem of coding low-entropy information sources is considered. Since the run-length code was offered about 50 years ago by Shannon, it is known that for such sources there exist coding methods much simpler than for sources of a general type. However, known coding methods of low-entropy sources do not reach the given redundancy. In this correspondence, a new method of coding low-entropy sources is offered. It permits a given redundancy r with almost the same encoder and decoder memory size as that obtained by Ryabko for general methods, while encoding and decoding much faster.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast and Efficient Coding of Low Entropy Sources with Two-sided Geometric Distribution

We propose a method for efficient coding of sources with two-sided geometric distribution (TSGD) and entropy near to or less than 1 bit. This method is based on the binary tree decomposition of source symbols combined with binary arithmetic coding and allows for fast and efficient implementation. It can be used for coding of transform coefficients in low bit-rate video and image compression sys...

متن کامل

Low Cost Video Compression Using Fast, Modified Z-Coding of Wavelet Pyramids

This paper describes a fast, low-complexity, entropy efficient video coder for wavelet pyramids. This coder approaches the entropy-limited coding rate of video wavelet pyramids, is fast in both hardware and software implementations, and has low complexity (no multiplies) for use in ASICs. It consists of a modified Z-coder used to code the zero/non-zero significance function and Huffman coding f...

متن کامل

Low-Complexity Waveform Coding via Alphabet and Sample-Set Partitioning

We propose a new low-complexity entropy-coding method to be used for coding waveform signals. It is based on the combination of two schemes: (1) an alphabet partitioning method to reduce the complexity of the entropy-coding process; (2) a new recursive set partitioning entropy-coding process that achieves rates smaller than rst order entropy even with fast Hu man adaptive codecs. Numerical resu...

متن کامل

Fast 3 D Mesh Compression Using Shared Vertex Analysis

© 2010 Euee Seon Jang et al. 163 A trend in 3D mesh compression is codec design with low computational complexity which preserves the input vertex and face order. However, this added information increases the complexity. We present a fast 3D mesh compression method that compresses the redundant shared vertex information between neighboring faces using simple first-order differential coding foll...

متن کامل

Conditional Entropy Constrained Tree Structured Vector Quantization with Applications to Sources with Memory

An algorithm is derived for designing tree structured vector quantizers to encode sources with memory The algorithm minimizes the average distortion subject to a conditional entropy constraint and the tree structure restriction This technique called conditional entropy constrained tree structured vector quantization CECTSVQ can more e ciently exploit the source memory This work is an extension ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 45  شماره 

صفحات  -

تاریخ انتشار 1999